Unifying Framework for Message Passing

نویسنده

  • Tomas Plachetka
چکیده

Theoretical models are difficult to apply for the analysis of practical message passing systems used today. We propose a model which can be used for such an analysis. Our framework for message passing is in many ways similar to the framework for transactional database systems. The abstract message passing system is defined in our framework independently of hardware, operating system and means of communication. The interface between the application and the message passing system consists of four basic abstract message passing operations. The application can be written in any programming language, provided that the application’s communication primitives can be translated into semantically equivalent sequences of the basic message passing operations. We prove that a restricted version of our model is as powerful as the unbounded asynchronous channel model. We also prove that MPI, the Message Passing Interface, is in some sense weaker than our restricted model and therefore also than the unbounded asynchronous channel model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Min-Max Message Passing and Local Consistency in Constraint Networks

In this paper, we uncover some relationships between local consistency in constraint networks and message passing akin to belief propagation in probabilistic reasoning. We develop a new message passing algorithm, called the min-max message passing (MMMP) algorithm, for unifying the different notions of local consistency in constraint networks. In particular, we study its connection to arc consi...

متن کامل

Unifying Message Passing Algorithms Under the Framework of Constrained Bethe Free Energy Minimization

Variational message passing (VMP), belief propagation (BP), expectation propagation (EP) and more recent generalized approximate message passing (GAMP) have found their wide uses in complex statistical inference problems. In addition to view them as a class of algorithms operating on graphical models, this paper unifies them under an optimization framework, namely, Bethe free energy minimizatio...

متن کامل

A Unifying Type-Theoretic Framework for Objects

We give a direct type-theoretic characterization of the basic mechanisms of object-oriented programming, including objects, methods, message passing, and subtyping, by introducing an explicit constructor for object types and suitable introduction, elimination, and equality rules. The resulting abstract framework provides a basis for justifying and comparing previous encodings of objects based o...

متن کامل

Automata and logics for message sequence charts

A message-passing automaton is an abstract model for the implementation of a distributed system whose components communicate via message exchange and thereby define a collection of communication scenarios called message sequence charts. In this thesis, we study several variants of message-passing automata in a unifying framework. We classify their expressiveness in terms of state-space properti...

متن کامل

Unifying Tree-Decomposition Schemes

The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas, such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Subsequently, the paper extends the variable-elimination scheme called bucket-elimination (BE) into a two-phase message passing along a bucket-tree (BTE), mak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006